Logical foundations for typed object-oriented languages
نویسندگان
چکیده
This paper presents logical foundations for the most important object-oriented language features, including abstract types, dynamic binding, subtyping, and inheritance. These foundations are introduced along with an object-oriented kernel language. We show how object environments of such languages can be formalized in an algebraic way. Based on this foundation, we develop a Hoare-style logic for formal veri cation of object-oriented programs.
منابع مشابه
Dialgebraic Semantics of Typed Object Calculi
Algebraic data type theory has a notion of structural recursion. Coalgebraic data types similarly have a notion of structural corecursion. In this thesis we study a third form of recursion: direcursion. The other two notions have been used in program derivations, correctness proofs, and in foundations of functional and class-based languages. Direcursion, on the other hand, has not been extensiv...
متن کاملA Logic for Encapsulation in Object Oriented
We present a logic language with encapsulation based on an object-oriented data model. We give a formal account of the semantics of this language by deening a proof theory, a model theory and a xed point theory. We also show that the diierent characterizations of the semantics are equivalent. We then study the logical foundations of encapsulation by introducing a mapping from our language to a ...
متن کاملA Logic for Encapsulation in Object-Oriented Languages
We present a logic language with encapsulation based on an object-oriented data model. We give a formal account of the semantics of this language by defining a proof theory, a model theory and a fixed point theory. We also show that the different characterizations of the semantics are equivalent. We then study the logical foundations of encapsulation by introducing a mapping from our language t...
متن کاملDesigning Type Inference for Typed Object-Oriented Languages
Designing Type Inference for Typed Object-Oriented Languages
متن کاملLogical Foundations for Declarative Object-oriented Programming Logical Foundations for Declarative Object-oriented Programming ?
We present a formalism for reasoning about declarative object-oriented programs. Classes are represented as rst-order theories that contain logic programs as methods. Inheritance, genericity and related concepts are represented by operations on such theories which preserve the consistency of these theories as well as the correctness of the programs speciied by their axioms. Our approach provide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998